The geostationary orbit and developing countries

The geostationary orbit is becoming congested due to use by several countries throughout the world, and the request for use of this orbit is increasing. There are 188 geostationary stations in operation. An equitable distribution of stations on this orbit is requested

Statistical Methods in Topological Data Analysis for Complex, High-Dimensional Data

The utilization of statistical methods an their applications within the new field of study known as Topological Data Analysis has has tremendous potential for broadening our exploration and understanding of complex, high-dimensional data spaces. This paper provides an introductory overview of the mathematical underpinnings of Topological Data Analysis, the workflow to convert samples of data to topological summary statistics, and some of the statistical methods developed for performing inference on these topological summary statistics. The intention of this non-technical overview is to motivate statisticians who are interested in learning more about the subject.Comment: 15 pages, 7 Figures, 27th Annual Conference on Applied Statistics in Agricultur

GPU Accelerated Discontinuous Galerkin Methods for Shallow Water Equations

We discuss the development, verification, and performance of a GPU accelerated discontinuous Galerkin method for the solutions of two dimensional nonlinear shallow water equations. The shallow water equations are hyperbolic partial differential equations and are widely used in the simulation of tsunami wave propagations. Our algorithms are tailored to take advantage of the single instruction multiple data (SIMD) architecture of graphic processing units. The time integration is accelerated by local time stepping based on a multi-rate Adams-Bashforth scheme. A total variational bounded limiter is adopted for nonlinear stability of the numerical scheme. This limiter is coupled with a mass and momentum conserving positivity preserving limiter for the special treatment of a dry or partially wet element in the triangulation. Accuracy, robustness and performance are demonstrated with the aid of test cases. We compare the performance of the kernels expressed in a portable threading language OCCA, when cross compiled with OpenCL, CUDA, and OpenMP at runtime.Comment: 26 pages, 51 figure

Orthogonality Relations and Supercharacter Formulas of U(m|n) Representations

In this paper we obtain the orthogonality relations for the supergroup U(m|n), which are remarkably different from the ones for the U(N) case. We extend our results for ordinary representations, obtained some time ago, to the case of complex conjugated and mixed representations. Our results are expressed in terms of the Young tableaux notation for irreducible representations. We use the supersymmetric Harish-Chandra-Itzykson-Zuber integral and the character expansion technique as mathematical tools for deriving these relations. As a byproduct we also obtain closed expressions for the supercharacters and dimensions of some particular irreducible U(m|n) representations. A new way of labeling the U(m|n) irreducible representations in terms of m + n numbers is proposed. Finally, as a corollary of our results, new identities among the dimensions of the irreducible representations of the unitary group U(N) are presented.Comment: 56 pages, LaTeX, changes only in the writing of the titl

Immune evasion of the CD1d/NKT cell axis

Many reviews on the CD1d/NKT cell axis focus on the ability of CD1d-restricted NKT cells to serve as effector cells in a variety of disorders, be they infectious diseases, cancer or autoimmunity. In contrast, here, we discuss the ways that viruses, bacteria and tumor cells can evade the CD1d/NKT cell axis. As a result, these disease states have a better chance to establish a foothold and potentially cause problems for the subsequent adaptive immune response, as the host tries to rid itself of infections or tumors

A first step to accelerating fingerprint matching based on deformable minutiae clustering

Fingerprint recognition is one of the most used biometric methods for authentication. The identification of a query fingerprint requires matching its minutiae against every minutiae of all the fingerprints of the database. The state-of-the-art matching algorithms are costly, from a computational point of view, and inefficient on large datasets. In this work, we include faster methods to accelerating DMC (the most accurate fingerprint matching algorithm based only on minutiae). In particular, we translate into C++ the functions of the algorithm which represent the most costly tasks of the code; we create a library with the new code and we link the library to the original C# code using a CLR Class Library project by means of a C++/CLI Wrapper. Our solution re-implements critical functions, e.g., the bit population count including a fast C++ PopCount library and the use of the squared Euclidean distance for calculating the minutiae neighborhood. The experimental results show a significant reduction of the execution time in the optimized functions of the matching algorithm. Finally, a novel approach to improve the matching algorithm, considering cache memory blocking and parallel data processing, is presented as future work.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech